Omitting types for infinitary [0,1]-valued logic
نویسنده
چکیده
We describe an infinitary logic for metric structures which is analogous to Lω1,ω . We show that this logic is capable of expressing several concepts from analysis that cannot be expressed in finitary continuous logic. Using topological methods, we prove an omitting types theorem for countable fragments of our infinitary logic. We use omitting types to prove a two-cardinal theorem, which yields a strengthening of a result of Ben Yaacov and Iovino concerning separable quotients of Banach spaces.
منابع مشابه
Omitting Types: Application to Descriptive Set Theory
The omitting types theorem of infinitary logic is used to prove that every small II set of analysis or any small 2. set of set theory is constructible. In what follows we could use either the omitting types theorem for infinitary logic or the same theorem for what Grilliot[2] calls (eA)-logic. I find the latter more appealing. Suppose i_ is a finitary logical language containing the symbols of ...
متن کاملOmitting uncountable types and the strength of [0, 1]-valued logics
We study a class of [0, 1]-valued logics for continuous metric structures. The main result of the paper is maximality theorem that characterizes these logics in terms of a model-theoretic property, namely, an extension of the omitting types theorem to uncountable languages.
متن کاملForcing and the Omitting Type Theorem, institutionally
In the context of proliferation of many logical systems in the area of mathematical logic and computer science, we present a generalization of forcing in institution-independent model theory which is used to prove an abstract Omitting Types Theorem (OTT). We instantiate this general result to many first-order logics, which are, roughly speaking, logics whose sentences can be constructed from at...
متن کاملA pr 2 01 3 Interpolation in many valued logics using algebraic logic Tarek
We prove several interpolation theorems for many valued infinitary logic with quantifiers, by studying expansions of MV algebras in the spirit of polyadic and cylindric algebras.
متن کاملSome properties of evaluated implications used in knowledge-based systems and data-mining
The core of expert knowledge is typically represented by a set of rules (implications) assigned with weights specifying their (un)certainties. The task of inference mechanism in such rulebased expert systems can be analyzed from the many-valued (fuzzy) logic perspective. On the other hand, implicational relations between two Boolean attributes derived from data (association rules) are quantifie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 165 شماره
صفحات -
تاریخ انتشار 2014